#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:		// 盛最多水的容器
    int maxArea(vector<int>& height) {
        int left = 0, right = height.size() - 1;
        int outcome = 0;

        while (left < right) {
            int v = (right - left) * min(height[left], height[right]);

            outcome = max(outcome,v);

            if (height[left] < height[right]) left++;
            else right--;
            
        }

        return outcome;
    }
};

int main()
{

	return 0;
}
